Diametral Paths in Total Graphs of Paths, Cycles and Stars
نویسندگان
چکیده
منابع مشابه
Characterization of signed paths and cycles admitting minus dominating function
If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.
متن کاملFinding simple paths and cycles in graphs
We describe a novel method, the method of random colorings, for finding simple paths and cycles of a specified length k in a graph G = (V,E). Using small bias probability spaces and families of perfect hash functions we can derandomize the randomized algorithms obtained using this method and obtain deterministic algorithms that establish the following new results: • For every fixed k, deciding ...
متن کاملFinding Paths and Cycles in Graphs
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish). Introduction Problem of path/cycle existence and finding is a big topic in Discrete Mathematics and Computer Science [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, and others]. This article is not a review but just another design. The design’s idea may be traced back ...
متن کاملHamiltonian Paths and Cycles in Planar Graphs
We examine the problem of counting the number of Hamiltonian paths and Hamiltonian cycles in outerplanar graphs and planar graphs, respectively. We give an O(nαn) upper bound and an Ω(αn) lower bound on the maximum number of Hamiltonian paths in an outerplanar graph with n vertices, where α ≈ 1.46557 is the unique real root of α = α + 1. For any positive integer n ≥ 6, we define an outerplanar ...
متن کاملLong cycles and paths in distance graphs
For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. Note that the important and very well-studied circulant graphs coincide with the regular distance graphs. A fundamental result concerning circulant graphs is that for these graphs, a simple greatest common divisor condition, their connectivity, and the existence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.10.21286